Decreasing - Diagrams - II By Bertram Felgenhauer
نویسنده
چکیده
This theory formalizes a commutation version of decreasing diagrams for Church-Rosser modulo. The proof follows Felgenhauer and van Oostrom (RTA 2013). The theory also provides important specializations, in particular van Oostrom’s conversion version (TCS 2008) of decreasing diagrams. We follow the development described in [1]: Conversions are mapped to Greek strings, and we prove that whenever a local peak (or cliff) is replaced by a joining sequence from a locally decreasing diagram, then the corresponding Greek strings become smaller in a specially crafted well-founded order on Greek strings. Once there are no more local peaks or cliffs are left, the result is a valley that establishes the Church-Rosser modulo property. As special cases we provide non-commutation versions and the conversion version of decreasing diagrams by van Oostrom [3]. We also formalize extended decreasingness [2].
منابع مشابه
Decreasing Diagrams II
This theory formalizes a commutation version of decreasing diagrams for Church-Rosser modulo. The proof follows Felgenhauer and van Oostrom (RTA 2013). The theory also provides important specializations, in particular van Oostrom’s conversion version (TCS 2008) of decreasing diagrams. We follow the development described in [1]: Conversions are mapped to Greek strings, and we prove that whenever...
متن کاملProof Orders for Decreasing Diagrams
We present and compare some well-founded proof orders for decreasing diagrams. These proof orders order a conversion above another conversion if the latter is obtained by filling any peak in the former by a (locally) decreasing diagram. Therefore each such proof order entails the decreasing diagrams technique for proving confluence. The proof orders differ with respect to monotonicity and compl...
متن کاملCertifying Confluence Proofs via Relative Termination and Rule Labeling
The rule labeling heuristic aims to establish confluence of (left-)linear term rewrite systems via decreasing diagrams. We present a formalization of a confluence criterion based on the interplay of relative termination and the rule labeling in the theorem prover Isabelle. Moreover, we report on the integration of this result into the certifier CeTA, facilitating the checking of confluence cert...
متن کامل24 th International Conference on Rewriting Techniques and Applications
Logical Model Checking of Infinite-State Systems Using Narrowing Kyungmin Bae, Santiago Escobar, and José Meseguer . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81 Compression of Rewriting Systems for Termination Analysis Alexander Bau, Markus Lohrey, Eric Nöth, and Johannes Waldmann . . . . . . . . . . . . 97 A Variant of Higher-Order Anti-Unification Alexander Baumgartner, Temur Kut...
متن کاملA Haskell Library for Term Rewriting
We present a Haskell library for first-order term rewriting covering basic operations on positions, terms, contexts, substitutions and rewrite rules. This effort is motivated by the increasing number of term rewriting tools that are written in Haskell.
متن کامل